Regularized Jacobi Iteration for Decentralized Convex Quadratic Optimization With Separable Constraints
نویسندگان
چکیده
منابع مشابه
Convergence Rate of an Optimization Algorithm for Minimizing Quadratic Functions with Separable Convex Constraints
A new active set algorithm for minimizing quadratic functions with separable convex constraints is proposed by combining the conjugate gradient method with the projected gradient. It generalizes recently developed algorithms of quadratic programming constrained by simple bounds. A linear convergence rate in terms of the Hessian spectral condition number is proven. Numerical experiments, includi...
متن کاملApproximating Global Quadratic Optimization with Convex Quadratic Constraints
We consider the problem of approximating the global maximum of a quadratic program (QP) subject to convex non-homogeneous quadratic constraints. We prove an approximation quality bound that is related to a condition number of the convex feasible set; and it is the currently best for approximating certain problems, such as quadratic optimization over the assignment polytope, according to the bes...
متن کاملPrivacy constraints in regularized convex optimization
Privacy concerns are becoming more important as more personal data moves online. It is therefore of interest to develop versions of data-processing algorithms which can be guaranteed to preserve the privacy of individuals’ data. A general method for creating a privacy-preserving version of a convex optimization problem is described, along with applications to machine learning, statistics, and r...
متن کاملMinimizing quadratic functions with separable quadratic constraints
This article deals with minimizing quadratic functions with a special form of quadratic constraints that arise in 3D contact problems of linear elasticity with isotropic friction [Haslinger, J., Kučera, R. and Dostál, Z., 2004, An algorithm for the numerical realization of 3D contact problems with Coulomb friction. Journal of Computational and Applied Mathematics, 164/165, 387–408.]. The propos...
متن کاملSeparable convex optimization with nested lower and upper constraints
We study a convex resource allocation problem in which lower and upper bounds are imposed on partial sums of allocations. This model is linked to a large range of applications, including production planning, speed optimization, stratified sampling, support vector machines, portfolio management, and telecommunications. We propose an efficient gradient-free divide-and-conquer algorithm, which use...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Control Systems Technology
سال: 2019
ISSN: 1063-6536,1558-0865,2374-0159
DOI: 10.1109/tcst.2018.2827990